Information theory and Communication Complexity - Lecture 2
نویسنده
چکیده
3 The randomized communication complexity of Disjointness 8 3.1 High level idea of the proof reduction to internal information of AND . . . 8 3.2 The Internal Information of AND . . . . . . . . . . . . . . . . . . . . . . . . 8 3.2.1 Divergence and Statistical Distance . . . . . . . . . . . . . . . . . . . 8 3.2.2 High level idea of the proof . . . . . . . . . . . . . . . . . . . . . . . 10 3.2.3 Fooling sets for randomized protocols . . . . . . . . . . . . . . . . . . 11 3.3 A short summary of the proof and some remarks . . . . . . . . . . . . . . . . 14
منابع مشابه
A multi agent method for cell formation with uncertain situation, based on information theory
This paper assumes the cell formation problem as a distributed decision network. It proposes an approach based on application and extension of information theory concepts, in order to analyze informational complexity in an agent- based system, due to interdependence between agents. Based on this approach, new quantitative concepts and definitions are proposed in order to measure the amount of t...
متن کامل5 . Applications to streaming
In this lecture, we will see applications of communication complexity to proving lower bounds for streaming algorithms. Towards the end of the lecture, we will introduce combinatorial auctions, and we will see applications of communication complexity to auctions in the next lecture. The references for this lecture include Lecture 7 of Troy Lee’s course on communication complexity [Lee10], Lectu...
متن کاملCS 2429 - Foundations of Communication Complexity Lecture # 7 : 31 October 2012 Lecturer : Lila Fontes
Another important technique for proving lower bounds in communication complexity comes from information theory. In Information Complexity and the Direct Sum Problem for Simultaneous Message Complexity (FOCS 2001), Chakrabarti, Shi, Wirth, and Yao introduced the notion of information complexity and used it to prove new lower bounds on the direct sum of the equality function. Follow-up work by Ba...
متن کاملConnections, Communication and Collaboration in Healthcare’s Complex Adaptive Systems; Comment on “Using Complexity and Network Concepts to Inform Healthcare Knowledge Translation”
A more sophisticated understanding of the unpredictable, disorderly and unstable aspects of healthcare organisations is developing in the knowledge translation (KT) literature. In an article published in this journal, Kitson et al introduced a new model for KT in healthcare based on complexity theory. The Knowledge Translation Complexity Network Model (KTCNM) provides a fresh perspective by mak...
متن کاملAlgorithmic Information Theory and Kolmogorov Complexity
This document contains lecture notes of an introductory course on Kolmogorov complexity. They cover basic notions of algorithmic information theory: Kolmogorov complexity (plain, conditional, prefix), notion of randomness (Martin-Löf randomness, Mises–Church randomness), Solomonoff universal a priori probability and their properties (symmetry of information, connection between a priori probabil...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2015